The inherent robustness of closed-loop scheduling

In closed-loop or online scheduling the realization of uncertainty in plant operations is addressed real-time though consistent and frequent reoptimization rescheduling. Although some simulation studies have explored robustness for specific case studies, there are no theoretical results addressing scheduling. this paper, we present justify an appropriate definition subject to large infrequent disturbances such as breakdowns delays. Assuming that a reasonable reference trajectory nominal system available, construct novel terminal constraint corresponding cost general production problem. Through assumptions establish proposed algorithm inherently robust large, disturbances. We conclude with example illustrate implications analysis. For example, outperforms typical algorithm.